Spanning maximal planar subgraphs of random graphs
نویسندگان
چکیده
منابع مشابه
Spanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملMaximal Planar Subgraphs of Fixed Girth in Random Graphs
In 1991, Bollobás and Frieze showed that the threshold for Gn,p to contain a spanning maximal planar subgraph is very close to p = n−1/3. In this paper, we compute similar threshold ranges for Gn,p to contain a maximal bipartite planar subgraph and for Gn,p to contain a maximal planar subgraph of fixed girth g.
متن کاملMinimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
متن کاملSpanning subgraphs of Random Graphs (A research problem)
We propose a problem concerning the determination of the threshold function for the edge probability that guarantees, almost surely, the existence of various sparse spanning subgraphs in random graphs. We prove some bounds and demonstrate them in the cases of a d-cube and a two dimensional lattice. B. Bollobás (cf. e.g., [3]) raised the following problem: Let G be a random graph with n = 2d ver...
متن کاملAlmost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal
Let ∆ ≥ 2 be a fixed integer. We show that the random graph Gn,p with p ≥ c(logn/n)1/∆is robust with respect to the containment of almost spanning bipartite graphs H with maximum degree ∆and sublinear bandwidth in the following sense. If an adversary deletes arbitrary edges in Gn,p such thateach vertex loses less than half of its neighbours, then asymptotically almost surely the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 1991
ISSN: 1042-9832
DOI: 10.1002/rsa.3240020206